Monotone, Horn and Quadratic Pseudo-Boolean Functions
نویسندگان
چکیده
A pseudo-Boolean function (pBf) is a mapping from f0; 1gn to the real numbers. It is known that pseudo-Boolean functions have polynomial representations, and it was recently shown that they also have disjunctive normal forms (DNFs). In this paper we relate the DNF syntax of the classes of monotone, quadratic and Horn pBfs to their characteristic inequalities.
منابع مشابه
Locally monotone Boolean and pseudo-Boolean functions
We propose local versions of monotonicity for Boolean and pseudoBoolean functions: say that a pseudo-Boolean (Boolean) function is p-locally monotone if none of its partial derivatives changes in sign on tuples which differ in less than p positions. As it turns out, this parameterized notion provides a hierarchy of monotonicities for pseudo-Boolean (Boolean) functions. Local monotonicities are ...
متن کاملPersistency for higher-order pseudo-boolean maximization
A pseudo-Boolean function is a function from a 0/1-vector to the reals. Minimizing pseudo-Boolean functions is a very general problem with many applications. In image analysis, the problem arises in segmentation or as a subroutine in task like stero estimation and image denoising. Recent years have seen an increased interest in higher-degree problems, as opposed to quadratic pseudo-Boolean func...
متن کاملThe steady state system problem is NP-hard even for monotone quadratic Boolean dynamical systems
In [2], the authors give a polynomial-time algorithm for deciding for a Boolean dynamical system in which each regulatory function is a monomial whether every limit cycle is a steady state. We show that the corresponding problem is NP-hard if the class of permissible regulatory functions contains the quadratic monotone functions xi ∨ xj and xi∧xj. We also show that the problem is NP-hard if the...
متن کاملGoals in the Propositional Horn Language Are Monotone Boolean Circuits
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of structuring programs in logic programming. Restricted to the propositional setting of this language, we prove that any goal in Horn⊃ can be translated into a monotone Boolean circuit which is linear in the size of the goal.
متن کاملThe influence of variables on pseudo-Boolean functions with applications to game theory and multicriteria decision making
The power of players in a collective decision process is a central issue in game theory. For this reason, the concept of influence of players on a simple game has been introduced. More generally, the influence of variables on Boolean functions has been defined and studied. We extend this concept to pseudo-Boolean functions, thus making it possible to appraise the degree of influence of any coal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. UCS
دوره 6 شماره
صفحات -
تاریخ انتشار 2000